On the Erdős–Szekeresn-interior-point problem
نویسندگان
چکیده
منابع مشابه
On the Erdos-Szekeres n-interior point problem
The n-interior point variant of the Erdős-Szekeres problem is the following: for any n, n ≥ 1, does there exist a g(n) such that every point set in the plane with at least g(n) interior points has a convex polygon containing exactly n-interior points. The existence of g(n) has been proved only for n ≤ 3. In this paper, we show that, for point sets having at most logarithmic number of convex lay...
متن کاملA path following interior-point algorithm for semidefinite optimization problem based on new kernel function
In this paper, we deal to obtain some new complexity results for solving semidefinite optimization (SDO) problem by interior-point methods (IPMs). We define a new proximity function for the SDO by a new kernel function. Furthermore we formulate an algorithm for a primal dual interior-point method (IPM) for the SDO by using the proximity function and give its complexity analysis, and then we sho...
متن کاملA Quadratically Convergent Interior-Point Algorithm for the P*(κ)-Matrix Horizontal Linear Complementarity Problem
In this paper, we present a new path-following interior-point algorithm for -horizontal linear complementarity problems (HLCPs). The algorithm uses only full-Newton steps which has the advantage that no line searchs are needed. Moreover, we obtain the currently best known iteration bound for the algorithm with small-update method, namely, , which is as good as the linear analogue.
متن کاملAn Interior-point Algorithm for the Maximum-volume Ellipsoid Problem
In this report, we consider the problem of nding the maximum-volume ellipsoid inscribing a given full-dimensional polytope in < n deened by a nite set of aane inequalities. We present several formulations for the problem that may serve as algorithmic frameworks for applying interior-point methods. We propose a practical interior-point algorithm based on one of the formulations and present preli...
متن کاملa path following interior-point algorithm for semidefinite optimization problem based on new kernel function
in this paper, we deal to obtain some new complexity results for solving semidefinite optimization (sdo) problem by interior-point methods (ipms). we define a new proximity function for the sdo by a new kernel function. furthermore we formulate an algorithm for a primal dual interior-point method (ipm) for the sdo by using the proximity function and give its complexity analysis, and then we sho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2014
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2013.06.028